On Factor Graphs and Electrical Networks
نویسندگان
چکیده
Factor graphs are graphical models with origins in coding theory. The sum-product and the max-product algorithms, which operate by message passing in a factor graph, subsume a great variety of algorithms in coding, signal processing, and artificial intelligence. In this paper, factor graphs are used to express a one-to-one correspondence (based on results by Dennis) between a class of static electrical circuits and multi-variable probability distributions; these factor graphs may also be viewed as variational representations of the electrical networks. For the classical linear state space models, both the sum-product algorithm and the max-product algorithm coincide with Kalman filtering. By the mentioned correspondence, these algorithms have a circuit theory interpretation that was discovered by Carter.
منابع مشابه
DALD:-Distributed-Asynchronous-Local-Decontamination Algorithm in Arbitrary Graphs
Network environments always can be invaded by intruder agents. In networks where nodes are performing some computations, intruder agents might contaminate some nodes. Therefore, problem of decontaminating a network infected by intruder agents is one of the major problems in these networks. In this paper, we present a distributed asynchronous local algorithm for decontaminating a network. In mos...
متن کاملEdge-tenacity in Networks
Numerous networks as, for example, road networks, electrical networks and communication networks can be modeled by a graph. Many attempts have been made to determine how well such a network is "connected" or stated differently how much effort is required to break down communication in the system between at least some nodes. Two well-known measures that indicate how "reliable" a graph is are the...
متن کاملKalman Filtering, Factor Graphs and Electrical Networks
Abstract Factor graphs are graphical models with origins in coding theory. It is well known that Kalman filtering is an instance of the generic sum(mary)-product algorithm on the corresponding factor graph. In this paper, a one-to-one correspondence between such factor graphs and a class of electrical networks is presented. The electrical network “computes” correct Bayesian estimates even for f...
متن کاملFactor Graphs and Dynamical Electrical Networks
Abstract — Factor graphs are graphical models with origins in coding theory. The sum-product and the maxproduct algorithms, which operate by message passing on a factor graph, subsume a great variety of algorithms in coding, signal processing, and artificial intelligence. This paper aims at extending the field of possible applications to dynamical electrical networks. Interestingly, the resulti...
متن کاملKalman Filters, Factor Graphs, and Electrical Networks
This post-diploma project highlights connections between Kalman filters, factor graphs, and electrical networks. Generally speaking, we are interested in the blockwise maximum a-posteriori estimation of random variables based on measurements of some related random variables. Such problems can very conveniently be stated using factor graphs that represent the joint probability density of all occ...
متن کامل